The perfect matching association scheme

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

Perfect Matching Preservers

For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.

Perfect Matching Disclosure Attacks

Traffic analysis is the best known approach to uncover relationships amongst users of anonymous communication systems, such as mix networks. Surprisingly, all previously published techniques require very specific user behavior to break the anonymity provided by mixes. At the same time, it is also well known that none of the considered user models reflects realistic behavior which casts some dou...

Srikumar 1 Perfect Matching and Matching Polytopes

A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane

In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0   are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most ) 1 (   times the optimal solution. In this paper, the authors give a randomized algorithm which follows a...